Diffusive persistence and the `sign-time' distribution

We present a new method for extracting the persistence exponent theta for the diffusion equation, based on the distribution P of `sign-times'. With the aid of a numerically verified Ansatz for P we derive an exact formula for theta in arbitrary spatial dimension d. Our results are in excellent agreement with previous numerical studies. Furthermore, our results indicate a qualitative change in P above d ~ 36, signalling the existence of a sharp change in the ergodic properties of the diffusion field.Comment: 5 pages, 2 tar gzip figures (Latex), subm. to PRE (Rapid Comm), new reference adde

A geometrical angle on Feynman integrals

A direct link between a one-loop N-point Feynman diagram and a geometrical representation based on the N-dimensional simplex is established by relating the Feynman parametric representations to the integrals over contents of (N-1)-dimensional simplices in non-Euclidean geometry of constant curvature. In particular, the four-point function in four dimensions is proportional to the volume of a three-dimensional spherical (or hyperbolic) tetrahedron which can be calculated by splitting into birectangular ones. It is also shown that the known formula of reduction of the N-point function in (N-1) dimensions corresponds to splitting the related N-dimensional simplex into N rectangular ones.Comment: 47 pages, including 42 pages of the text (in plain Latex) and 5 pages with the figures (in a separate Latex file, requires axodraw.sty) a note and three references added, minor problem with notation fixe

Eutactic quantum codes

We consider sets of quantum observables corresponding to eutactic stars. Eutactic stars are systems of vectors which are the lower dimensional ``shadow'' image, the orthogonal view, of higher dimensional orthonormal bases. Although these vector systems are not comeasurable, they represent redundant coordinate bases with remarkable properties. One application is quantum secret sharing.Comment: 6 page

Invariant and polynomial identities for higher rank matrices

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct discriminants and the determinant as the discriminant of order $d$, where $d$ is the dimension of the matrix. The characteristic polynomials and the Cayley--Hamilton theorem for higher rank matrices are obtained there from

Hyperdeterminants as integrable discrete systems

We give the basic definitions and some theoretical results about hyperdeterminants, introduced by A. Cayley in 1845. We prove integrability (understood as 4d-consistency) of a nonlinear difference equation defined by the 2x2x2-hyperdeterminant. This result gives rise to the following hypothesis: the difference equations defined by hyperdeterminants of any size are integrable. We show that this hypothesis already fails in the case of the 2x2x2x2-hyperdeterminant.Comment: Standard LaTeX, 11 pages. v2: corrected a small misprint in the abstrac

Classification of multipartite entangled states by multidimensional determinants

We find that multidimensional determinants "hyperdeterminants", related to entanglement measures (the so-called concurrence or 3-tangle for the 2 or 3 qubits, respectively), are derived from a duality between entangled states and separable states. By means of the hyperdeterminant and its singularities, the single copy of multipartite pure entangled states is classified into an onion structure of every closed subset, similar to that by the local rank in the bipartite case. This reveals how inequivalent multipartite entangled classes are partially ordered under local actions. In particular, the generic entangled class of the maximal dimension, distinguished as the nonzero hyperdeterminant, does not include the maximally entangled states in Bell's inequalities in general (e.g., in the $n \geq 4$ qubits), contrary to the widely known bipartite or 3-qubit cases. It suggests that not only are they never locally interconvertible with the majority of multipartite entangled states, but they would have no grounds for the canonical n-partite entangled states. Our classification is also useful for the mixed states.Comment: revtex4, 10 pages, 4 eps figures with psfrag; v2 title changed, 1 appendix added, to appear in Phys. Rev.

Volumes of polytopes in spaces of constant curvature

We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a solution for Seidel problem on the volume of non-Euclidean tetrahedron. Finally, we consider a convex hyperbolic quadrilateral inscribed in a circle, horocycle or one branch of equidistant curve. This is a natural hyperbolic analog of the cyclic quadrilateral in the Euclidean plane. We find a few versions of the Brahmagupta formula for the area of such quadrilateral. We also present a formula for the area of a hyperbolic trapezoid.Comment: 22 pages, 9 figures, 58 reference

Volume formula for a Z2\mathbb{Z}_2-symmetric spherical tetrahedron through its edge lengths

The present paper considers volume formulae, as well as trigonometric identities, that hold for a tetrahedron in 3-dimensional spherical space of constant sectional curvature +1. The tetrahedron possesses a certain symmetry: namely rotation through angle $\pi$ in the middle points of a certain pair of its skew edges.Comment: 27 pages, 2 figures; enhanced and improved exposition, typos corrected; Arkiv foer Matematik, 201

Error bounds for the large-argument asymptotic expansions of the Hankel and Bessel functions

In this paper, we reconsider the large-argument asymptotic expansions of the Hankel, Bessel and modified Bessel functions and their derivatives. New integral representations for the remainder terms of these asymptotic expansions are found and used to obtain sharp and realistic error bounds. We also give re-expansions for these remainder terms and provide their error estimates. A detailed discussion on the sharpness of our error bounds and their relation to other results in the literature is given. The techniques used in this paper should also generalize to asymptotic expansions which arise from an application of the method of steepest descents.Comment: 32 pages, 2 figures, accepted for publication in Acta Applicandae Mathematica

Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications

Abstract. Let A be an n by N real-valued matrix with n < N; we count the number of k-faces fk(AQ) when Q is either the standard N-dimensional hypercube IN or else the positive orthant RN +. To state results simply, consider a proportional-growth asymptotic, where for fixed δ, ρ in (0, 1), we have a sequence of matrices An,Nn and of integers kn with n/Nn → δ, kn/n → ρ as n → ∞. If each matrix An,Nn has its columns in general position, then fk(AIN)/fk(I N) tends to zero or one depending on whether ρ> min(0, 2 − δ−1) or ρ < min(0, 2 − δ−1). Also, if each An,Nn is a random draw from a distribution which is invariant under right multiplication by signed permutations, then fk(ARN +)/fk(RN +) tends almost surely to zero or one depending on whether ρ> min(0, 2 − δ−1) or ρ < min(0, 2 − δ−1). We make a variety of contrasts to related work on projections of the simplex and/or cross-polytope. These geometric face-counting results have implications for signal processing, information theory, inverse problems, and optimization. Indeed, face counting is related to conditions for uniqueness of solutions of underdetermine